Application-oriented Self-organizing Hierarchical Clustering in Dynamic Networks

We are urrently developping a suite of self-organizing lustering algorithms whi h will automati ally adapt to network dynami s in response to appli ation-spe i requirements. As a starting point, we identify groups of dynami network appli ations, or appli ation lasses, whi h will use a ommon family of lustering algorithms. Within an appli ation lass, the performan e requirements of individual appli ations is translated into a ommon set of lustering onstraints | these onstraints determine whi h lustering algorithm(s) is (are) well suited for ea h appli ation lass. We present some initial ideas for developping lustering algorithms for a parti ular appli ation lass, whi h ontains power-aware routing appli ations. 1 Department of Computer S ien e and Engineering, Arizona State University, Tempe, AZ 85287{5406, ari ha asu.edu. This work was supported in part by NSF CAREER Award CCR{9985284. 2 Department of Computer Engineering, University of California at Santa Cruz, Santa Cruz, CA 95064, katia se.u s .edu. This work was supported in part by NSF NGI grant number ANI-9813724. 3Department of Computer S ien e and Engineering, Arizona State University, Tempe, AZ 85287{5406, asen asu.edu. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. POMC 2001 Newport, Rhode Island USA Copyright 2001 ACM 1-58113-397-9/01/08 ...$5.00.